Sciweavers

1658 search results - page 310 / 332
» Implementing Bit-addressing with Specialization
Sort
View
ICALP
1998
Springer
14 years 2 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
14 years 2 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
14 years 2 months ago
The InfoSleuth Project
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
Roberto J. Bayardo Jr., William Bohrer, Richard S....
AGENTS
1997
Springer
14 years 2 months ago
An Intelligent Assistant for Patient Health Care
The Patient Advocate is designed to be an intelligent assistant for patient-centered health care. Residing on a home computer or special-purpose device and operating within an ext...
Silvia Miksch, Kenneth Cheng, Barbara Hayes-Roth
VLDB
1997
ACM
134views Database» more  VLDB 1997»
14 years 2 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner