Sciweavers

2621 search results - page 345 / 525
» Near orders and codes
Sort
View
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 11 months ago
Evaluating very large datalog queries on social networks
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
Royi Ronen, Oded Shmueli
ICC
2000
IEEE
241views Communications» more  ICC 2000»
15 years 11 months ago
Power Management for Throughput Enhancement in Wireless Ad-Hoc Networks
—In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different trans...
Tamer A. ElBatt, Srikanth V. Krishnamurthy, Dennis...
ICPP
2000
IEEE
15 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
SIGCOMM
1999
ACM
15 years 11 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
15 years 11 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli