817 search results - page 148 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
NPAR
2004
ACM
14 years 28 days ago
2004
ACM
Algorithms that detect silhouettes, creases, and other edge based features often perform per-edge and per-face mesh computations using global adjacency information. These are unsu...
FLAIRS
1998
13 years 8 months ago
1998
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...