Sciweavers

3602 search results - page 177 / 721
» Isn't It About Time
Sort
View
100
Voted
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
15 years 5 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
87
Voted
ICPR
2006
IEEE
16 years 1 months ago
Change detection in streetscapes from GPS coordinated omni-directional image sequences
As part of ITS technology, to achieve quick map updates, we propose a method for automatically detecting changes in streetscapes from images captured by car-mounted omnidirectiona...
Hiroshi Murase, Ichiro Ide, Junji Sato, Tomokazu T...
92
Voted
SIGSOFT
2005
ACM
16 years 1 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
92
Voted
ICC
2009
IEEE
110views Communications» more  ICC 2009»
15 years 7 months ago
Delay Constrained Scheduling over Fading Channels: Optimal Policies for Monomial Energy-Cost Functions
— A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit co...
Juyul Lee, Nihar Jindal
94
Voted
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 7 months ago
Temporal Analysis of Semantic Graphs Using ASALSAN
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
Brett W. Bader, Richard A. Harshman, Tamara G. Kol...