Sciweavers

8824 search results - page 1533 / 1765
» On the Complexity of Real Functions
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
NGC
2000
Springer
15 years 10 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
OODBS
2000
110views Database» more  OODBS 2000»
15 years 10 months ago
Opportunistic Prioritised Clustering Framework (OPCF)
Ever since the `early days' of database management systems, clustering has proven to be one of the most effective performance enhancement techniques for object oriented datab...
Zhen He, Alonso Marquez, Stephen Blackburn
NOSSDAV
1991
Springer
15 years 10 months ago
Multimedia Synchronization and UNIX
One of the most important emerging developments for improving the user/computer interface has been the addition of multimedia facilities to high-performance workstations. Although...
Dick C. A. Bulterman, Robert van Liere
MOBISYS
2010
ACM
15 years 9 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan
« Prev « First page 1533 / 1765 Last » Next »