1648 search results - page 75 / 330 » Where to Build a Door |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
GLOBECOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—This paper describes a wireless mesh network testbed for research in rapid deployment and auto-configuration of mesh nodes. Motivated by the needs of first responders and mili...
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper, we describe CALM, a method for building statistical language models for the Web. CALM addresses several unique challenges dealing with the Web contents. First, CALM...
PKDD
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...