Sciweavers

539 search results - page 105 / 108
» Recurrence relations and fast algorithms
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 1 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 1 months ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl
IMC
2006
ACM
14 years 1 months ago
Comprehensive view of a live network coding P2P system
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
Christos Gkantsidis, John Miller, Pablo Rodriguez
CCS
2004
ACM
14 years 24 days ago
Privacy and security in library RFID: issues, practices, and architectures
We expose privacy issues related to Radio Frequency Identification (RFID) in libraries, describe current deployments, and suggest novel architectures for library RFID. Libraries ...
David Molnar, David Wagner