Sciweavers

10608 search results - page 260 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
133
Voted
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
13 years 3 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
IEICET
2006
56views more  IEICET 2006»
15 years 16 days ago
Reconfiguration Heuristics for Logical Topologies in Wide-Area WDM Networks
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
Hironao Takagi, Yongbing Zhang, Hideaki Takagi
149
Voted
BMCBI
2011
14 years 7 months ago
ASPDock: protein-protein docking algorithm using atomic solvation parameters model
Background: Atomic Solvation Parameters (ASP) model has been proven to be a very successful method of calculating the binding free energy of protein complexes. This suggests that ...
Lin Li, Dachuan Guo, Yangyu Huang, Shiyong Liu, Yi...
102
Voted
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
15 years 4 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
Itzhak Parnafes, Ran Raz, Avi Wigderson
126
Voted
MSO
2003
15 years 1 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris