Sciweavers

9209 search results - page 89 / 1842
» Data Space Randomization
Sort
View
JMLR
2010
119views more  JMLR 2010»
14 years 9 months ago
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data
Different aspects of the curse of dimensionality are known to present serious challenges to various machine-learning methods and tasks. This paper explores a new aspect of the dim...
Milos Radovanovic, Alexandros Nanopoulos, Mirjana ...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 3 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
122
Voted
EMNLP
2011
14 years 2 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III
123
Voted
VLSID
2005
IEEE
131views VLSI» more  VLSID 2005»
16 years 2 months ago
Efficient Space/Time Compression to Reduce Test Data Volume and Testing Time for IP Cores
Abstract-- We present two-dimensional (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) core...
Lei Li, Krishnendu Chakrabarty, Seiji Kajihara, Sh...
111
Voted
GIS
1999
ACM
15 years 6 months ago
Spatio-Temporal Conceptual Models: Data Structures + Space + Time
Nowadays, many applications need data modeling facilities for the description of complex objects with spatial and/or temporal facilities. Responses to such requirements may be fou...
Christine Parent, Stefano Spaccapietra, Esteban Zi...