Sciweavers

1332 search results - page 201 / 267
» Combinatorial Algorithms
Sort
View
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 8 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
JIIS
2006
147views more  JIIS 2006»
13 years 7 months ago
Mining sequential patterns from data streams: a centroid approach
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...
Alice Marascu, Florent Masseglia
VTC
2006
IEEE
138views Communications» more  VTC 2006»
14 years 1 months ago
Simulated Annealing based Wireless Sensor Network Localization with Flip Ambiguity Mitigation
Abstract— Accurate self-localization capability is highly desirable in wireless sensor networks. A major problem in wireless sensor network localization is the flip ambiguity, w...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
KI
2001
Springer
14 years 9 days ago
Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
RAS
2002
129views more  RAS 2002»
13 years 7 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun