712 search results - page 42 / 143 » Sorting and selection on dynamic data |
103
click to vote
IEEEVAST
2010
14 years 6 months ago
2010
Modern visualization methods are needed to cope with very highdimensional data. Efficient visual analytical techniques are required to extract the information content in these dat...
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it pos...
108
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
PRL
2002
14 years 11 months ago
2002
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
112
click to vote
SARA
2007
Springer
15 years 6 months ago
2007
Springer
Several recent techniques for solving Markov decision processes use dynamic Bayesian networks to compactly represent tasks. The dynamic Bayesian network representation may not be g...