962 search results - page 168 / 193 » Efficient Algorithms for Eulerian Extension |
POPL
1992
ACM
15 years 1 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
SI3D
2006
ACM
15 years 3 months ago
2006
ACM
Shade Trees Morgan McGuire George Stathis Hanspeter Pfister Shriram Krishnamurthi Brown University Harvard Extension School MERL Brown University As GPU-powered special effects be...
ICNP
1999
IEEE
15 years 2 months ago
1999
IEEE
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
83
Voted
IWCMC
2010
ACM
14 years 11 months ago
2010
ACM
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...