Sciweavers

1431 search results - page 87 / 287
» The complexity of random ordered structures
Sort
View
MP
2007
95views more  MP 2007»
15 years 3 days ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
133
Voted
WWW
2010
ACM
15 years 7 months ago
Automatic extraction of clickable structured web contents for name entity queries
Today the major web search engines answer queries by showing ten result snippets, which need to be inspected by users for identifying relevant results. In this paper we investigat...
Xiaoxin Yin, Wenzhao Tan, Xiao Li, Yi-Chin Tu
IS
2010
14 years 11 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
RECOMB
2004
Springer
16 years 28 days ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
CN
2006
61views more  CN 2006»
15 years 20 days ago
Structuring topologically aware overlay networks using domain names
Abstract-- Overlay networks are application layer systems which facilitate users in performing distributed functions such as searches over the contents of other users. An important...
Demetrios Zeinalipour-Yazti, Vana Kalogeraki