14165 search results - page 2720 / 2833 » The generalized two-server problem |
146
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
137
click to vote
CICLING
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
143
click to vote
ECRIME
2007
15 years 8 months ago
2007
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
119
Voted
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
158
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...