490 search results - page 14 / 98 » Practical Extensions to the IFDS Algorithm |
SIGCSE
1999
ACM
15 years 1 months ago
1999
ACM
In order to build a data structure that is extensible and reusable, it is necessary to decouple the intrinsic and primitive behavior of the structure from the application specific...
101
Voted
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
101
click to vote
CGO
2011
IEEE
14 years 1 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
112
click to vote
KDD
2012
ACM
13 years 1 days ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
115
click to vote
BMCBI
2010
14 years 4 months ago
2010
Background: The development, in the last decade, of stochastic heuristics implemented in robust application softwares has made large phylogeny inference a key step in most compara...