Sciweavers

648 search results - page 72 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 8 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
COMPLEX
2009
Springer
14 years 2 months ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
SAT
2010
Springer
158views Hardware» more  SAT 2010»
13 years 11 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
14 years 2 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani