1857 search results - page 217 / 372 » Minimum Degree Orderings |
172
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper we show that, surprisingly, it is possible to recover sparse signals from nonlinearly distorted measurements, even if the nonlinearity is unknown. Assuming just that...
234
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
210
click to vote
LOGCOM
2011
14 years 9 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
328
click to vote
ICDE
1995
IEEE
16 years 7 months ago
1995
IEEE
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
162
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...