Sciweavers

6368 search results - page 917 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
171
Voted
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
16 years 12 days ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
CVIU
2011
14 years 10 months ago
A comparative study of object-level spatial context techniques for semantic image analysis
Abstract—In this paper, three approaches to utilizing objectlevel spatial contextual information for semantic image analysis are presented and comparatively evaluated. Contextual...
Georgios Th. Papadopoulos, Carsten Saathoff, Hugo ...
188
Voted
IPL
2008
80views more  IPL 2008»
15 years 6 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
208
Voted
MOBICOM
2004
ACM
16 years 9 days ago
Initializing newly deployed ad hoc and sensor networks
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
174
Voted
IPPS
1997
IEEE
15 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen