Sciweavers

2137 search results - page 319 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
MOBIHOC
2006
ACM
16 years 4 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
MOC
2000
126views more  MOC 2000»
15 years 4 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
TOG
2010
106views more  TOG 2010»
14 years 11 months ago
Accelerating spatially varying Gaussian filters
High-dimensional Gaussian filters, most notably the bilateral filter, are important tools for many computer graphics and vision tasks. In recent years, a number of techniques for ...
Jongmin Baek, David E. Jacobs
JMLR
2010
144views more  JMLR 2010»
14 years 11 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 5 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb