Sciweavers

662 search results - page 111 / 133
» Making inferences with small numbers of training sets
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
ISMAR
2003
IEEE
14 years 2 months ago
Resolving Multiple Occluded Layers in Augmented Reality
A useful function of augmented reality (AR) systems is their ability to visualize occluded infrastructure directly in a user’s view of the environment. This is especially import...
Mark A. Livingston, J. Edward Swan II, Joseph L. G...
PODC
2006
ACM
14 years 2 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 2 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
INFOCOM
2003
IEEE
14 years 2 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi