Sciweavers

4934 search results - page 249 / 987
» complexity 2008
Sort
View
TCS
2008
15 years 5 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
VC
2008
95views more  VC 2008»
15 years 5 months ago
1001 Acquisition viewpoints: efficient and versatile view-dependent modeling of real-world scenes
Modeling is a severe bottleneck for computer graphics applications. Manual modeling is time consuming and fails to capture the complexity of real world scenes. Automated modeling b...
Mihai Mudure, Voicu Popescu
IEE
2002
92views more  IEE 2002»
15 years 5 months ago
Comparison of Web size measures for predicting Web design and authoring effort
: Software practitioners recognise the importance of realistic estimates of effort for the successful management of software projects, the Web being no exception. Estimates are nec...
Emilia Mendes, Nile Mosley, Steve Counsell
CHI
2008
ACM
16 years 6 months ago
Values, value and worth: their relationship to hci?
This workshop explores the territory of `value-centred HCI' with the intention of freeing us from the tricky complexity of this topic and the multiple meanings of the words `...
David J. Gilmore, Gilbert Cockton, Elizabeth F. Ch...
DCC
2008
IEEE
16 years 5 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth