Sciweavers

2907 search results - page 439 / 582
» Presentations of Structures in Admissible Sets
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 6 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
SIGMOD
2009
ACM
148views Database» more  SIGMOD 2009»
16 years 6 months ago
Combining keyword search and forms for ad hoc querying of databases
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan...
SIGMOD
2006
ACM
125views Database» more  SIGMOD 2006»
16 years 6 months ago
A non-linear dimensionality-reduction technique for fast similarity search in large databases
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
SIGMOD
2005
ACM
135views Database» more  SIGMOD 2005»
16 years 6 months ago
Mining data streams: a review
The recent advances in hardware and software have enabled the capture of different measurements of data in a wide range of fields. These measurements are generated continuously an...
Mohamed Medhat Gaber, Arkady B. Zaslavsky, Shonali...
PERCOM
2006
ACM
16 years 5 months ago
Dynamic Peer-To-Peer Overlays for Voice Systems
Different devices, such as mobile phones, soft phones, or desktop phones, have varying processing power, bandwidth, and media capabilities. Heterogeneous P2P voice systems that ar...
Krishna Kishore Dhara, Salman Baset