Sciweavers

515 search results - page 87 / 103
» Layouts of Expander Graphs
Sort
View
LREC
2008
159views Education» more  LREC 2008»
13 years 11 months ago
Corpus Exploitation from Wikipedia for Ontology Construction
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
Gaoying Cui, Qin Lu, Wenjie Li, Yi-Rong Chen
NIPS
2004
13 years 11 months ago
Co-Training and Expansion: Towards Bridging Theory and Practice
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
Maria-Florina Balcan, Avrim Blum, Ke Yang
IJCAI
1989
13 years 10 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
TOC
2008
122views more  TOC 2008»
13 years 9 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
TON
2008
122views more  TON 2008»
13 years 9 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano