Sciweavers

1129 search results - page 96 / 226
» Finding Similar Failures Using Callstack Similarity
Sort
View
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
14 years 8 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 8 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
IPM
2008
52views more  IPM 2008»
13 years 8 months ago
Investigating the information-seeking behaviour of academic lawyers: From Ellis's model to design
by studying lawyers, analyse information-seeking at a high level of abstraction and are only likely to lead to broad-scoped design insights. We illustrate that one potentially usef...
Stephann Makri, Ann Blandford, Anna Louise Cox
TPDS
2008
134views more  TPDS 2008»
13 years 7 months ago
Extending the TokenCMP Cache Coherence Protocol for Low Overhead Fault Tolerance in CMP Architectures
It is widely accepted that transient failures will appear more frequently in chips designed in the near future due to several factors such as the increased integration scale. On th...
Ricardo Fernández Pascual, José M. G...
BMCBI
2010
113views more  BMCBI 2010»
13 years 8 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu