Sciweavers

114 search results - page 21 / 23
» Partial Orders, Event Structures and Linear Strategies
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
13 years 7 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
BIS
2010
159views Business» more  BIS 2010»
13 years 1 months ago
Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
Jérémy Besson, Ieva Mitasiunaite, Au...
ICCV
2011
IEEE
12 years 6 months ago
Learning a Category Independent Object Detection Cascade
Cascades are a popular framework to speed up object detection systems. Here we focus on the first layers of a category independent object detection cascade in which we sample a l...
Esa Rahtu, Juho Kannala, Matthew Blaschko
NHM
2010
87views more  NHM 2010»
13 years 27 days ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 6 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu