Sciweavers

344 search results - page 18 / 69
» On the Discrete Symmetric Localization Problem
Sort
View
AIPS
2007
15 years 14 days ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris
PODC
2005
ACM
15 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
14 years 10 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 9 months ago
Convergent discrete Laplace-Beltrami operators over surfaces
The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial diff...
Jyh-Yang Wu, Mei-Hsiu Chi, Sheng-Gwo Chen
CIKM
2005
Springer
15 years 3 months ago
Discretization based learning approach to information retrieval
We approached the problem as learning how to order documents by estimated relevance with respect to a user query. Our support vector machines based classifier learns from the rele...
Dmitri Roussinov, Weiguo Fan, Fernando A. Das Neve...