Sciweavers

125 search results - page 15 / 25
» Semidefinite representation of convex sets
Sort
View
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
14 years 3 days ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
AAAI
2000
13 years 9 months ago
An Interval Algebra for Indeterminate Time
Temporal indeterminacy is an inherent problem which arises when capturing and manipulating temporal data in many application areas. As such, representation and manipulation of tim...
Wes Cowley, Dimitris Plexousakis
ICML
2008
IEEE
14 years 8 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
RAS
2007
113views more  RAS 2007»
13 years 7 months ago
From images to rooms
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
Zoran Zivkovic, Olaf Booij, Ben J. A. Kröse
JSCIC
2010
231views more  JSCIC 2010»
13 years 2 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher