Sciweavers

2194 search results - page 250 / 439
» Improving HLRTA*( k )
Sort
View
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
16 years 1 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
INFOCOM
2007
IEEE
15 years 7 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
ICALP
2010
Springer
15 years 6 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
ICCV
2007
IEEE
16 years 3 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
15 years 8 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia