Sciweavers

418 search results - page 50 / 84
» Circularity Measuring in Linear Time
Sort
View
GI
2007
Springer
15 years 6 months ago
On Sensor Scheduling in Case of Unreliable Communication
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
Marco F. Huber, Eric Stiegeler, Uwe D. Hanebeck
PERVASIVE
2004
Springer
15 years 5 months ago
"Are You with Me?" - Using Accelerometers to Determine If Two Devices Are Carried by the Same Person
As the proliferation of pervasive and ubiquitous computing devices continues, users will carry more devices. Without the ability for these devices to unobtrusively interact with on...
Jonathan Lester, Blake Hannaford, Gaetano Borriell...
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
15 years 5 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
NIPS
2008
15 years 1 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
NIPS
2004
15 years 1 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp