Sciweavers

406 search results - page 33 / 82
» Database-friendly random projections
Sort
View
CORR
2007
Springer
146views Education» more  CORR 2007»
13 years 7 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
AAAI
2008
13 years 10 months ago
Manifold Integration with Markov Random Walks
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...
Heeyoul Choi, Seungjin Choi, Yoonsuck Choe
TMI
2008
138views more  TMI 2008»
13 years 7 months ago
Accurate Event-Driven Motion Compensation in High-Resolution PET Incorporating Scattered and Random Events
With continuing improvements in spatial resolution of positron emission tomography (PET) scanners, small patient movements during PET imaging become a significant source of resolut...
Arman Rahmim, Katie Dinelle, Ju-Chieh Cheng, Mikha...
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 7 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
ACSC
2009
IEEE
14 years 2 months ago
Using Chronological Splitting to Compare Cross- and Single-company Effort Models: Further Investigation
Numerous studies have used historical datasets to build and validate models for estimating software development effort. Very few used a chronological split (where projects’ end ...
Chris Lokan, Emilia Mendes