Sciweavers

482 search results - page 83 / 97
» Large Caps in Small Spaces
Sort
View
DBA
2006
236views Database» more  DBA 2006»
13 years 9 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
WORM
2004
13 years 9 months ago
Toward understanding distributed blackhole placement
The monitoring of unused Internet address space has been shown to be an effective method for characterizing Internet threats including Internet worms and DDOS attacks. Because the...
Evan Cooke, Michael Bailey, Zhuoqing Morley Mao, D...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 8 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
MOBICOM
2010
ACM
13 years 7 months ago
Indoor localization without the pain
While WiFi-based indoor localization is attractive, the need for a significant degree of pre-deployment effort is a key challenge. In this paper, we ask the question: can we perfo...
Krishna Chintalapudi, Anand Padmanabha Iyer, Venka...
EOR
2007
165views more  EOR 2007»
13 years 7 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang