Sciweavers

1274 search results - page 159 / 255
» Graph lambda theories
Sort
View
PODC
2010
ACM
14 years 1 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
EUROCOLT
1995
Springer
14 years 21 days ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
CIKM
2008
Springer
13 years 11 months ago
Error-driven generalist+experts (edge): a multi-stage ensemble framework for text categorization
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...
Jian Huang 0002, Omid Madani, C. Lee Giles
IJON
2007
81views more  IJON 2007»
13 years 9 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
TON
2008
106views more  TON 2008»
13 years 9 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...