Sciweavers

1068 search results - page 122 / 214
» Factorization as a Rank 1 Problem
Sort
View
COMPGEOM
2003
ACM
15 years 3 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
15 years 2 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
SPDP
1991
IEEE
15 years 1 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
BIS
2010
227views Business» more  BIS 2010»
14 years 11 months ago
Using SPARQL and SPIN for Data Quality Management on the Semantic Web
The quality of data is a key factor that determines the performance of information systems, in particular with regard (1) to the amount of exceptions in the execution of business p...
Christian Fürber, Martin Hepp
ICML
2010
IEEE
14 years 11 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio