Sciweavers

5169 search results - page 311 / 1034
» Locality approximation using time
Sort
View
NIPS
2007
15 years 8 months ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
INFFUS
2006
128views more  INFFUS 2006»
15 years 6 months ago
Distributed detection in a large wireless sensor network
A distributed detection and decision fusion scheme is proposed for a wireless sensor network (WSN) consisting of a large number of sensors. At the fusion center, the total number ...
Ruixin Niu, Pramod K. Varshney, Qi Cheng
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
15 years 6 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
16 years 1 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
POPL
2003
ACM
16 years 7 months ago
From symptom to cause: localizing errors in counterexample traces
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
Thomas Ball, Mayur Naik, Sriram K. Rajamani