Sciweavers

147 search results - page 23 / 30
» Parallel Query Processing and Edge Ranking of Graphs
Sort
View
SAC
2005
ACM
15 years 3 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
62
Voted
MLG
2007
Springer
15 years 3 months ago
Weighted Substructure Mining for Image Analysis
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku K...
CVPR
2010
IEEE
15 years 5 months ago
Estimating Camera Pose from a Single Urban Ground-View Omnidirectional Image and a 2D Building Outline Map
A framework is presented for estimating the pose of a camera based on images extracted from a single omnidirectional image of an urban scene, given a 2D map with building outlines...
Tat-Jen Cham, Ciptadi Arridhana, Wei-Chian Tan, Mi...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 4 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman