Sciweavers

962 search results - page 168 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
POPL
1992
ACM
15 years 9 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
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...
Atsushi Ohori
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 5 months ago
De-duping URLs via rewrite rules
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...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
SI3D
2006
ACM
15 years 11 months ago
Abstract shade trees
Shade Trees Morgan McGuire George Stathis Hanspeter Pfister Shriram Krishnamurthi Brown University Harvard Extension School MERL Brown University As GPU-powered special effects be...
Morgan McGuire, George Stathis, Hanspeter Pfister,...
ICNP
1999
IEEE
15 years 9 months ago
Effect of Unreliable Nodes on QoS Routing
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&...
Swapna S. Gokhale, Satish K. Tripathi
IWCMC
2010
ACM
15 years 7 months ago
Decentralized service composition in pervasive computing environments
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...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...