Sciweavers

4541 search results - page 780 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
198
Voted
MOBICOM
2006
ACM
16 years 11 days ago
Boundary recognition in sensor networks by topological methods
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
Yue Wang, Jie Gao, Joseph S. B. Mitchell
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 10 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
16 years 3 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
XSYM
2009
Springer
136views Database» more  XSYM 2009»
16 years 1 months ago
Optimizing XML Compression
Abstract. The eXtensible Markup Language (XML) provides a powerful and flexible means of encoding and exchanging data. As it turns out, its main advantage as an encoding format (n...
Gregory Leighton, Denilson Barbosa
162
Voted
BMCBI
2007
175views more  BMCBI 2007»
15 years 6 months ago
CLUSS: Clustering of protein sequences based on a new similarity measure
Background: The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important. The challenge is to identify subfamilies...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski...