42 search results - page 6 / 9 » Bisimulation on Speed: Lower Time Bounds |
188
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
94
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
126
click to vote
COMGEO
2008
ACM
15 years 22 days ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
97
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
102
Voted
PC
2008
15 years 18 days ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...