Sciweavers

11565 search results - page 2012 / 2313
» Computing Minimal Mappings
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
A highly scalable bandwidth estimation of commercial hotspot access points
—WiFi access points that provide Internet access to users have been steadily increasing in urban areas. Different access points differ from one another in terms of services that ...
Xinyu Xing, Jianxun Dang, Shivakant Mishra, Xue Li...
MOC
2011
14 years 9 months ago
Calculating cyclotomic polynomials
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
Andrew Arnold, Michael B. Monagan
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 9 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
COCOON
2011
Springer
14 years 6 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
« Prev « First page 2012 / 2313 Last » Next »