Sciweavers

5962 search results - page 1005 / 1193
» Efficient Clustering for Orders
Sort
View
DAGM
2010
Springer
15 years 7 months ago
Random Fourier Approximations for Skewed Multiplicative Histogram Kernels
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
Fuxin Li, Catalin Ionescu, Cristian Sminchisescu
CIDR
2009
152views Algorithms» more  CIDR 2009»
15 years 7 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener
CIDR
2009
145views Algorithms» more  CIDR 2009»
15 years 7 months ago
Continuous Analytics: Rethinking Query Processing in a Network-Effect World
Modern data analysis applications driven by the Network Effect are pushing traditional database and data warehousing technologies beyond their limits due to their massively increa...
Michael J. Franklin, Sailesh Krishnamurthy, Neil C...
DEXAW
2010
IEEE
215views Database» more  DEXAW 2010»
15 years 7 months ago
An Evaluation Approach for Dynamics-Aware Applications Using Linked Data
One possible threat to linked data quality is the lack of knowledge about the dynamics in dependent remote datasets. Linked data consuming applications often need to be aware of ch...
Niko Popitsch, Bernhard Haslhofer, Elaheh Momeni R...
CONEXT
2009
ACM
15 years 7 months ago
SWARM: the power of structure in community wireless mesh networks
Community wireless networks (CWNs) have been proposed to spread broadband network access to underprivileged, underprovisioned and remote areas. Research has focused on optimizing ...
Saumitra M. Das, Konstantina Papagiannaki, Suman B...
« Prev « First page 1005 / 1193 Last » Next »