Sciweavers

8655 search results - page 1611 / 1731
» Challenges for Trusted Computing
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
VLDB
2005
ACM
109views Database» more  VLDB 2005»
15 years 10 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
SIGMOD
2009
ACM
122views Database» more  SIGMOD 2009»
15 years 10 months ago
Finding min-repros in database software
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
Nicolas Bruno, Rimma V. Nehme
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
15 years 10 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
15 years 10 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
« Prev « First page 1611 / 1731 Last » Next »