Sciweavers

10608 search results - page 1726 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 7 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
TAMC
2009
Springer
15 years 7 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
88
Voted
CANDC
2009
ACM
15 years 7 months ago
2DEQ: an intuitive audio equalizer
The complexity of music production tools can be a significant bottleneck in the creative process. Here we describe the development of a simple, intuitive audio equalizer with the ...
Andrew T. Sabin, Bryan Pardo
CF
2009
ACM
15 years 7 months ago
Strategies for dynamic memory allocation in hybrid architectures
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
Peter Bertels, Wim Heirman, Dirk Stroobandt
96
Voted
HT
2009
ACM
15 years 7 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
« Prev « First page 1726 / 2122 Last » Next »