Sciweavers

1399 search results - page 159 / 280
» New Algorithms for k-Center and Extensions
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 9 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 9 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
ICCAD
2006
IEEE
106views Hardware» more  ICCAD 2006»
14 years 5 months ago
Wire density driven global routing for CMP variation and timing
In this paper, we propose the first wire density driven global routing that considers CMP variation and timing. To enable CMP awareness during global routing, we propose a compac...
Minsik Cho, David Z. Pan, Hua Xiang, Ruchir Puri
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 3 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
INFOCOM
2009
IEEE
14 years 3 months ago
Passive Loss Inference in Wireless Sensor Networks Based on Network Coding
Abstract—The highly stochastic nature of wireless environments makes it desirable to monitor link loss rates in wireless sensor networks. In this paper, we study the loss inferen...
Yunfeng Lin, Ben Liang, Baochun Li