Sciweavers

679 search results - page 99 / 136
» Algorithmic modifications to SPIHT
Sort
View
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
16 years 3 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
RECOMB
2006
Springer
16 years 3 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
ICFP
2004
ACM
16 years 3 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch
117
Voted
DCC
2006
IEEE
16 years 2 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
WSDM
2010
ACM
203views Data Mining» more  WSDM 2010»
16 years 18 days ago
Query Reformulation Using Anchor Text
Query reformulation techniques based on query logs have been studied as a method of capturing user intent and improving retrieval effectiveness. The evaluation of these techniques...
Van Dang, Bruce W. Croft