Sciweavers

175 search results - page 19 / 35
» max-cut and Containment Relations in Graphs
Sort
View
DM
2008
82views more  DM 2008»
13 years 8 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 10 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
COCOON
2003
Springer
14 years 1 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
KI
2009
Springer
14 years 3 months ago
Maximum a Posteriori Estimation of Dynamically Changing Distributions
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
Michael Volkhardt, Sören Kalesse, Steffen M&u...
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
14 years 2 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle