Sciweavers

2745 search results - page 163 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
164
Voted
NETWORKING
2007
15 years 5 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
IJCAI
2003
15 years 5 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
MICS
2007
100views more  MICS 2007»
15 years 3 months ago
A New Method for Real Root Isolation of Univariate Polynomials
A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arit...
Ting Zhang, Bican Xia
CIKM
2005
Springer
15 years 9 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
128
Voted
WCNC
2008
IEEE
15 years 10 months ago
A Density Adaptive Routing Protocol for Large-Scale Ad Hoc Networks
Abstract—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and ...
Zhizhou Li, Yaxiong Zhao, Yong Cui, Dong Xiang