CORR 1999 - PDF Preprint Papers

CORR 1999 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-1999 Paper

click to vote

CORR
1999
Springer

222views Education» more CORR 1999»

Analysis of approximate nearest neighbor searching with clustered point sets

14 years 3 days ago

Download www.cs.umd.edu

Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...

Songrit Maneewongvatana, David M. Mount

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	222	Analysis of approximate nearest neighbor searching with clustered point sets	claim
2	164	Annotation graphs as a framework for multidimensional linguistic data analysis	claim
3	145	Subgraph Isomorphism in Planar Graphs and Related Problems	claim
4	143	Collective Intelligence for Control of Distributed Dynamical Systems	claim
5	139	Combinatorics of branchings in higher dimensional automata	claim
6	138	A simple proof of the unconditional security of quantum key distribution	claim
7	124	An Algebraic Programming Style for Numerical Software and its Optimization	claim
8	120	Cross-Language Information Retrieval for Technical Documents	claim
9	120	Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals	claim
10	120	A Machine-Independent Debugger--Revisited	claim
11	118	Supervised Grammar Induction Using Training Data with Limited Constituent Information	claim
12	116	Efficient and Extensible Algorithms for Multi Query Optimization	claim
13	115	The Symbol Grounding Problem	claim
14	112	Learning Transformation Rules to Find Grammatical Relations	claim
15	111	Ensembles of Radial Basis Function Networks for Spectroscopic Detection of Cervical Pre-Cancer	claim
16	111	On Bounded-Weight Error-Correcting Codes	claim
17	110	Managing Object-Oriented Integration and Regression Testing	claim
18	108	Evaluation of the NLP Components of the OVIS2 Spoken Dialogue System	claim
19	107	WebScript - A Scripting Language for the Web	claim
20	105	Hinged Dissection of Polyominoes and Polyforms	claim
21	104	A Bootstrap Approach to Automatically Generating Lexical Transfer Rules	claim
22	104	Brittle System Analysis	claim
23	103	A Control and Management Network for Wireless ATM Systems	claim
24	98	A variational description of the ground state structure in random satisfiability problems	claim
25	97	A Formal Framework for Linguistic Annotation	claim
26	96	Comparative Analysis of Five XML Query Languages	claim
27	95	Fixed-parameter tractability, definability, and model checking	claim
28	95	Circular Separability of Polygons	claim
29	94	Performance of data networks with random links	claim
30	93	On the Power of Positive Turing Reductions	claim
31	93	Empirically Evaluating an Adaptable Spoken Dialogue System	claim
32	92	The importance of quantum decoherence in brain processes	claim
33	89	Ununfoldable Polyhedra with Convex Faces	claim
34	86	Robust Grammatical Analysis for Spoken Dialogue Systems	claim
35	85	Microsoft TerraServer: A Spatial Data Warehouse	claim
36	84	Finding an ordinary conic and an ordinary hyperplane	claim
37	84	Representing Text Chunks	claim
38	83	Cascaded Grammatical Relation Assignment	claim
39	82	Inside-Outside Estimation of a Lexicalized PCFG for German	claim
40	81	Inducing a Semantically Annotated Lexicon via EM-Based Clustering	claim
41	81	Explanation-based Learning for Machine Translation	claim
42	81	Network Management of Predictive Mobile Networks	claim
43	81	The Average-Case Area of Heilbronn-Type Triangles	claim
44	80	Computational Mechanics: Pattern and Prediction, Structure and Simplicity	claim
45	79	Cascaded Markov Models	claim
46	78	Multiparty computation unconditionally secure against Q^2 adversary structures	claim
47	78	An Introduction to Collective Intelligence	claim
48	77	Beyond Concern: Understanding Net Users' Attitudes About Online Privacy	claim
49	76	Cox's Theorem Revisited	claim
50	76	A simple C++ library for manipulating scientific data sets as structured data	claim
51	76	Mixing Metaphors	claim
52	76	Resolving Part-of-Speech Ambiguity in the Greek Language Using Learning Techniques	claim
53	75	A System of Interaction and Structure	claim
54	74	The Study on the Nonlinear Computations of the DQ and DC Methods	claim
55	74	A Unified Example-Based and Lexicalist Approach to Machine Translation	claim
56	74	A Brief History of the Internet	claim
57	72	Detecting Sub-Topic Correspondence through Bipartite Term Clustering	claim
58	72	The Sources of Certainty in Computation and Formal Systems	claim
59	71	New Error Bounds for Solomonoff Prediction	claim
60	70	Restart Strategies and Internet Congestion	claim
61	69	Selective Magic HPSG Parsing	claim
62	67	Probabilistic Agent Programs	claim
63	67	Transducers from Rewrite Rules with Backreferences	claim
64	67	ZBroker: A Query Routing Broker for Z39.50 Databases	claim
65	67	Robust Combining of Disparate Classifiers through Order Statistics	claim
66	66	Two-way finite automata with quantum and classical states	claim
67	66	Pronoun Resolution in Japanese Sentences Using Surface Expressions and Examples	claim
68	65	Modeling Belief in Dynamic Systems, Part II: Revision and Update	claim
69	65	Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets	claim
70	65	Mapping Multilingual Hierarchies Using Relaxation Labeling	claim
71	64	Polynomial-Time Multi-Selectivity	claim
72	63	Mutual Search	claim
73	61	Query Order and the Polynomial Hierarchy	claim
74	61	Language Identification With Confidence Limits	claim
75	59	HMM Specialization with Selective Lexicalization	claim
76	58	Representation Theory for Default Logic	claim
77	57	An Efficient, Probabilistically Sound Algorithm for Segmentation and Word Discovery	claim
78	57	MSO definable string transductions and two-way finite state transducers	claim
79	52	The union of unit balls has quadratic complexity, even if they all contain the origin	claim
80	50	An Example-Based Approach to Japanese-to-English Translation of Tense Aspect, and Modality	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers