Sciweavers

284 search results - page 49 / 57
» What Matchings Can Be Stable
Sort
View
JFP
2006
78views more  JFP 2006»
13 years 9 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
WWW
2011
ACM
13 years 4 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...
IRFC
2011
Springer
13 years 1 months ago
Applying Web Usage Mining for Adaptive Intranet Navigation
Much progress has recently been made in assisting a user in the search process, be it Web search where the big search engines have now all incorporated more interactive features or...
Sharhida Zawani Saad, Udo Kruschwitz
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 10 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
SIGIR
2004
ACM
14 years 3 months ago
Resource selection for domain-specific cross-lingual IR
An under-explored question in cross-language information retrieval (CLIR) is to what degree the performance of CLIR methods depends on the availability of high-quality translation...
Monica Rogati, Yiming Yang