Sciweavers

1792 search results - page 95 / 359
» What Are We Arguing About
Sort
View
HOTNETS
2010
13 years 5 months ago
A case for information-bound referencing
Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol...
Ashok Anand, Aditya Akella, Vyas Sekar, Srinivasan...
JCP
2007
127views more  JCP 2007»
13 years 10 months ago
Defending Cyberspace with Fake Honeypots
—Honeypots are computer systems designed for no purpose other than recording attacks on them. Cyberattackers should avoid them since honeypots jeopardize the secrecy of attack me...
Neil C. Rowe, E. John Custy, Binh T. Duong
PVLDB
2010
179views more  PVLDB 2010»
13 years 8 months ago
Nearest Neighbor Search with Strong Location Privacy
The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial...
Stavros Papadopoulos, Spiridon Bakiras, Dimitris P...
CHI
2004
ACM
14 years 10 months ago
Interactive Comprehensible Data Mining
This paper discusses a novel data mining system devised and developed at Birmingham, which attempts to provide a more effective data mining system. It ties in with the workshop go...
Andy Pryke, Russell Beale
AAAI
2008
14 years 15 days ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...