Sciweavers

1282 search results - page 98 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
PERCOM
2011
ACM
14 years 6 months ago
Tracking vehicular speed variations by warping mobile phone signal strengths
—In this paper, we consider the problem of tracking fine-grained speeds variations of vehicles using signal strength traces from GSM enabled phones. Existing speed estimation te...
Gayathri Chandrasekaran, Tam Vu, Alexander Varshav...
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
15 years 8 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
ICSE
2007
IEEE-ACM
16 years 2 months ago
A Discreet, Fault-Tolerant, and Scalable Software Architectural Style for Internet-Sized Networks
Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for Inter...
Yuriy Brun
120
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Decentralized support detection of multiple measurement vectors with joint sparsity
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...
Qing Ling, Zhi Tian
ICANN
2007
Springer
15 years 8 months ago
MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
Leonardo Franco, José Luis Subirats, Jos&ea...