Sciweavers

13436 search results - page 2437 / 2688
» e
Sort
View
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 11 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 11 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
ISPASS
2010
IEEE
15 years 11 months ago
A study of hardware assisted IP over InfiniBand and its impact on enterprise data center performance
— High-performance sockets implementations such as the Sockets Direct Protocol (SDP) have traditionally showed major performance advantages compared to the TCP/IP stack over Infi...
Ryan E. Grant, Pavan Balaji, Ahmad Afsahi
MIR
2010
ACM
217views Multimedia» more  MIR 2010»
15 years 11 months ago
Feature selection for content-based, time-varying musical emotion regression
In developing automated systems to recognize the emotional content of music, we are faced with a problem spanning two disparate domains: the space of human emotions and the acoust...
Erik M. Schmidt, Douglas Turnbull, Youngmoo E. Kim
172
Voted
WWW
2010
ACM
15 years 11 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
« Prev « First page 2437 / 2688 Last » Next »