Sciweavers

1517 search results - page 183 / 304
» New Approach To A Class Of Matrices
Sort
View
ICALP
2009
Springer
16 years 5 months ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
16 years 2 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
WWW
2010
ACM
15 years 11 months ago
RESTler: crawling RESTful services
Service descriptions allow designers to document, understand, and use services, creating new useful and complex services with aggregated business value. Unlike RPC-based services,...
Rosa Alarcón, Erik Wilde
CSEE
2009
Springer
15 years 11 months ago
Using Software Project Courses to Integrate Education and Research: An Experience Report
At University of Southern California (USC), CSCI577ab is a graduate software engineering course that teaches best software engineering practices and allows students to apply the l...
Supannika Koolmanojwong, Barry W. Boehm
ICTIR
2009
Springer
15 years 11 months ago
Robust Word Similarity Estimation Using Perturbation Kernels
We introduce perturbation kernels, a new class of similarity measure for information retrieval that casts word similarity in terms of multi-task learning. Perturbation kernels mode...
Kevyn Collins-Thompson