Sciweavers

1129 search results - page 116 / 226
» Finding Similar Failures Using Callstack Similarity
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model
The routing performance of delay tolerant networks (DTN) is highly correlated with the distribution of inter-contact times (ICT), the time period between two successive contacts o...
Seongik Hong, Injong Rhee, Seong Joon Kim, Kyungha...
ACMSE
2006
ACM
13 years 10 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 3 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
BMCBI
2007
99views more  BMCBI 2007»
13 years 8 months ago
Towards validating the hypothesis of phylogenetic profiling
Background: As the number of fully sequenced genome increases, the need is greater for bioinformatics to predict or annotate genes of a newly sequenced genome. Ever since Eisenber...
Raja Loganantharaj, Mazen Atwi