Sciweavers

74 search results - page 6 / 15
» Finding Large Independent Sets in Polynomial Expected Time
Sort
View
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 3 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 8 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
FLAIRS
2008
13 years 11 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 2 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
CVPR
1998
IEEE
14 years 10 months ago
Segmentation by Grouping Junctions
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
Hiroshi Ishikawa 0002, Davi Geiger