Sciweavers

858 search results - page 22 / 172
» One Is Enough!
Sort
View
COMBINATORICA
2007
117views more  COMBINATORICA 2007»
13 years 8 months ago
Embedding nearly-spanning bounded degree trees
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
Noga Alon, Michael Krivelevich, Benny Sudakov
TCSV
2002
88views more  TCSV 2002»
13 years 8 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
AAAI
2010
13 years 7 months ago
Simultaneous Elicitation of Preference Features and Utility
Most frameworks for utility elicitation assume a predefined set of features over which user preferences are expressed. We consider utility elicitation in the presence of subjecti...
Craig Boutilier, Kevin Regan, Paolo Viappiani
JIRS
2006
104views more  JIRS 2006»
13 years 8 months ago
Symbolic Trajectory Description in Mobile Robotics
Abstract. Autonomous mobile robot navigation systems are based on three principal kinds of techniques: map-based navigation, map-building-based navigation and mapless navigation. W...
Gilbert Pradel, Philippe Hoppenot
CVPR
2000
IEEE
14 years 10 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura