AbnerCYH's testing [32 articles] Export

Recent papers added to AbnerCYH's library classified by the tag testing. You can also see everyone's testing.

	Testing contractibility in planar rips complexes [My Copy] In SCG '08: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008), pp. 251-259. by Erin W. Chambers, Jeff Erickson, Pratik Worah posted to algorithms stochastic testing topology by AbnerCYH on 2009-06-02 21:16:24 as
	Testing Euclidean minimum spanning trees in the plane [My Copy] ACM Trans. Algorithms, Vol. 4, No. 3. (2008), pp. 1-23. by Artur Czumaj, Christian Sohler posted to algorithms graph stochastic testing by AbnerCYH on 2009-03-06 03:32:51 as
	Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time [My Copy] SIAM Journal on Computing, Vol. 35, No. 1. (2005), pp. 91-109. by Artur Czumaj, Funda Ergün, Lance Fortnow, et al.Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler posted to algorithms graph testing by AbnerCYH on 2009-03-06 01:52:21 as
	A separation theorem in property testing [My Copy] Combinatorica, Vol. 28, No. 3. (1 May 2008), pp. 261-281. by Noga Alon, Asaf Shapira posted to algorithms complexity testing by AbnerCYH on 2008-08-20 10:45:43 as
	A characterization of easily testable induced subgraphs [My Copy] In SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (2004), pp. 942-951. by Noga Alon, Asaf Shapira posted to algorithms stochastic testing by AbnerCYH on 2008-08-13 06:37:32 as
	A Characterization of the (Natural) Graph Properties Testable with One-Sided Error [My Copy] SIAM Journal on Computing, Vol. 37, No. 6. (2008), pp. 1703-1727. by Noga Alon, Asaf Shapira posted to algorithms graph testing by AbnerCYH on 2008-08-04 15:59:45 as
	An optimal algorithm for checking regularity: (extended abstract) [My Copy] In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), pp. 277-286. by Y. Kohayakawa, V. Rödl, L. Thoma posted to algorithms combinatorics stochastic testing by AbnerCYH on 2008-07-10 17:00:34 as
	Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems [My Copy] In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), pp. 74-83. by Béla Csaba, Marek Karpinski, Piotr Krysta posted to algorithms combinatorics complexity graph testing by AbnerCYH on 2008-07-06 19:24:02 as
	Property testing in hypergraphs and the removal lemma [My Copy] In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007), pp. 488-495. by V. Rödl, M. Schacht posted to algorithms combinatorics graph testing by AbnerCYH on 2008-07-06 19:23:40 as
	Testing versus estimation of graph properties [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 138-146. by Eldar Fischer, Ilan Newman posted to algorithms combinatorics graph testing by AbnerCYH on 2008-07-06 19:22:35 as
	The algorithmic aspects of the regularity lemma [My Copy] J. Algorithms, Vol. 16, No. 1. (January 1994), pp. 80-109. by N. Alon, R. A. Duke, H. Lefmann, V. R&\#246;dl, R. Yuster posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:51 as along with 1 person bfraser
	The regularity lemma and approximation schemes for dense problems [My Copy] In FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (1996) by A. Frieze posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:49 as
	Property testing and its connection to learning and approximation [My Copy] J. ACM, Vol. 45, No. 4. (July 1998), pp. 653-750. by Oded Goldreich, Shari Goldwasser, Dana Ron posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:45 as
	On characterizing hypergraph regularity [My Copy] Random Struct. Algorithms, Vol. 21, No. 3-4. (2002), pp. 293-335. by Y. Dementieva, P. E. Haxell, B. Nagle, V. Rödl posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:09:28 as
	An optimal algorithm for checking regularity: (extended abstract) [My Copy] In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), pp. 277-286. by Y. Kohayakawa, V. Rödl, L. Thoma posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:08:58 as
	Hardness of fully dense problems [My Copy] Inf. Comput., Vol. 205, No. 8. (August 2007), pp. 1117-1129. by Nir Ailon, Noga Alon posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-05 14:08:27 as
	The Regularity Lemma and Its Applications in Graph Theory [My Copy] Theoretical Aspects of Computer Science (2002), pp. 149-152. by János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-07-03 14:26:39 as
	Space Complexity Vs. Query Complexity [My Copy] Computational Complexity, Vol. 17, No. 1. (6 April 2008), pp. 70-93. by Oded Lachish, Ilan Newman, Asaf Shapira posted to complexity stochastic testing by AbnerCYH on 2008-06-10 04:04:58 as
	On the testability and repair of hereditary hypergraph properties [My Copy] (14 Jan 2008) by Tim Austin, Terence Tao posted to algorithms combinatorics graph stochastic testing by AbnerCYH on 2008-01-24 14:34:28 as along with 1 person mdreid
	Every Minor-Closed Property of Sparse Graphs is Testable [My Copy] (18 Jan 2008) by Itai Benjamini, Oded Schramm, Asaf Shapira posted to algorithms graph testing by AbnerCYH on 2008-01-21 20:27:22 as along with 1 person wanderyao
	Symbolic dynamic analysis of complex systems for anomaly detection [My Copy] Signal Process., Vol. 84, No. 7. (July 2004), pp. 1115-1130. by Asok Ray posted to dynamics kdd math testing by AbnerCYH on 2007-12-27 17:24:33 as
	Pattern identification in dynamical systems via symbolic time series analysis [My Copy] Pattern Recogn., Vol. 40, No. 11. (November 2007), pp. 2897-2907. by Venkatesh Rajagopalan, Asok Ray, Rohan Samsi, Jeffrey Mayer posted to dynamics kdd math testing by AbnerCYH on 2007-12-27 17:24:20 as
	Symbolic time series analysis for anomaly detection: A comparative evaluation [My Copy] Signal Processing, Vol. 85, No. 9. (September 2005), pp. 1859-1868. by S. Chin, A. Ray, V. Rajagopalan posted to dynamics kdd math testing by AbnerCYH on 2007-12-27 17:24:06 as along with 2 people akavipat sdvillal
	Testing the diameter of graphs [My Copy] Random Struct. Algorithms, Vol. 20, No. 2. (March 2002), pp. 165-183. by Michal Parnas, Dana Ron posted to algorithms graph testing by AbnerCYH on 2007-12-21 20:39:40 as
	The mutual information: Detecting and evaluating dependencies between variables [My Copy] Bioinformatics, Vol. 18 (2002), pp. S231-S240. by R. Steuer, J. Kurths, C. O. Daub, J. Weise, J. Selbig posted to biology information math stochastic testing by AbnerCYH on 2007-11-26 13:37:16 as
	On the strength of comparisons in property testing [My Copy] Information and Computation, Vol. 189, No. 1. (25 February 2004), pp. 107-116. by Eldar Fischer posted to algorithms complexity testing by AbnerCYH on 2007-11-10 12:14:37 as
	On the Complexity of Partial Order Properties [My Copy] Order, Vol. 17, No. 2. (1 June 2000), pp. 179-193. by Stefan Felsner, Ravi Kant, Pandu C. Rangan, Dorothea Wagner posted to combinatorics complexity order testing topology by AbnerCYH on 2007-10-23 04:27:47 as
	Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing [My Copy] Theoretical Computer Science, Vol. 234, No. 1-2. (6 March 2000), pp. 59-84. by Michel Habib, Ross Mcconnell, Christophe Paul, Laurent Viennot posted to algorithms graph testing by AbnerCYH on 2007-10-10 14:49:35 as
	Efficient Planarity Testing [My Copy] J. ACM, Vol. 21, No. 4. (October 1974), pp. 549-568. by John Hopcroft, Robert Tarjan posted to algorithms graph testing by AbnerCYH on 2007-10-10 12:02:50 as along with 1 person arsyed
	Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms [My Copy] J. Comput. Syst. Sci., Vol. 13, No. 3. (1976), pp. 335-379. by Kellogg S. Booth, George S. Lueker posted to algorithms graph testing by AbnerCYH on 2007-10-10 11:59:22 as
	Property Testing of Regular Tree Languages [My Copy] Algorithmica by Frédéric Magniez, Michel de Rougemont posted to algorithms automata stochastic testing by AbnerCYH on 2007-09-19 14:15:18 as along with 1 group CSBBGraphTheory
	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes [My Copy] (18 May 2005) by David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg posted to algorithms complexity information testing by AbnerCYH on 2007-07-26 12:36:23 as along with 1 person and 1 group rmk CSBBGraphTheory

Note: You may cite this page as: http://www.citeulike.org/user/AbnerCYH/tag/testing

algorithms	687
graph	478
complexity	189
combinatorics	150
kdd	128
biology	128
math	127
complex	125
stochastic	113
topology	82
optimization	63
geometries	62
order	61
algebra	56
data_structure	52
dynamics	43
parameterized	38
testing	32
information	28
logic	27
automata	22
game	19
parallel	18
distributed	15
economic	14
sys_performance	14
string	7
neuro	6
history	4

AbnerCYH's testing [32 articles] Export

AbnerCYH's tags