223
click to vote
CSMR
2011
IEEE
14 years 10 months ago
2011
IEEE
—The advent of globalization has led to the adoption of distributed software development as a common practice. One of its drawbacks -the absence of impromptu meetingsis tackled w...
206
click to vote
CSMR
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Developers introduce novel and undocumented micro-architectures when performing evolution tasks on object-oriented applications. We are interested in understanding wheth...
191
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
201
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The correlation of the result lists provided by search engines is fundamental and it has deep and multidisciplinary ramifications. Here, we present automatic and unsupervised met...
180
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
159
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
220
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
207
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...
192
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...