Sciweavers

187 search results - page 33 / 38
» On the Natural Imprint Function of a Graph
Sort
View
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 2 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
FPL
2001
Springer
96views Hardware» more  FPL 2001»
15 years 2 months ago
System Level Tools for DSP in FPGAs
Abstract. Visual data ow environments are ideally suited for modeling digital signal processing (DSP) systems, as many DSP algorithms are most naturally speci ed by signal ow gra...
James Hwang, Brent Milne, Nabeel Shirazi, Jeffrey ...
CIDM
2007
IEEE
15 years 1 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
AAAI
2010
14 years 11 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
14 years 11 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...