Sciweavers

485 search results - page 83 / 97
» Weighted Factorization
Sort
View
JMM2
2006
146views more  JMM2 2006»
13 years 8 months ago
Probabilistic Algorithms, Integration, and Empirical Evaluation for Disambiguating Multiple Selections in Frustum-Based Pointing
There are a few fundamental pointing-based user interface techniques for performing selections in 3D environments. One of these techniques is ray pointing, which makes selections b...
Greg S. Schmidt, Dennis G. Brown, Erik B. Tomlin, ...
TSE
2002
105views more  TSE 2002»
13 years 7 months ago
Disaggregating and Calibrating the CASE Tool Variable in COCOMO II
CASE (Computer Aided Software Engineering) tools are believed to have played a critical role in improving software productivity and quality by assisting tasks in software developme...
Jongmoon Baik, Barry W. Boehm, Bert Steece
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 10 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 9 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...