Sciweavers

7434 search results - page 1458 / 1487
» Still
Sort
View
SCHEDULING
2011
14 years 6 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
Michael Gatto, Peter Widmayer
TC
2011
14 years 6 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
TIT
2011
149views more  TIT 2011»
14 years 6 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
TITS
2011
165views more  TITS 2011»
14 years 6 months ago
Robust Inference of Principal Road Paths for Intelligent Transportation Systems
Abstract—Over the last few years, electronic vehicle guidance systems have become increasingly more popular. However, despite their ubiquity, performance will always be subject t...
Gabriel Agamennoni, Juan Nieto, Eduardo Mario Nebo...
WWW
2011
ACM
14 years 6 months ago
A self-training approach for resolving object coreference on the semantic web
An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify “equivalent” URIs that denote the ...
Wei Hu, Jianfeng Chen, Yuzhong Qu
« Prev « First page 1458 / 1487 Last » Next »