Sciweavers

1285 search results - page 215 / 257
» On the Complexity of Ordinal Clustering
Sort
View
SRDS
1998
IEEE
13 years 12 months ago
Interactive Image Retrieval over the Internet
In the paper, an e cient image database system is developed. The most important features of the proposed system include compressed domain indexing, searching by using scalable fea...
Jozsef Vass, Jia Yao, Anupam Joshi, Kannappan Pala...
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
13 years 12 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar
IPPS
1996
IEEE
13 years 12 months ago
Implementing the Data Diffusion Machine Using Crossbar Routers
The Data Diffusion Machine is a scalable virtual shared memory architecture. A hierarchical network is used to ensure that all data can be located in a time bounded by O(logp), wh...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...
SIGCOMM
1996
ACM
13 years 12 months ago
Multicasting Protocols for High-Speed, Wormhole-Routing Local Area Networks
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
Mario Gerla, Prasasth Palnati, Simon Walton
FSTTCS
1993
Springer
13 years 11 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...