Sciweavers

5244 search results - page 703 / 1049
» Structural Complexity of AvgBPP
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Practical quad mesh simplification
n this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. T...
Marco Tarini, Nico Pietroni, Paolo Cignoni, Daniel...
SAC
2010
ACM
16 years 1 months ago
Gray networking: a step towards next generation computer networks
Modern networks are very complex. It is highly desirable to reduce management complexity in next generation network design. Researchers have been seeking inspiration in natural ob...
Piyush Harsh, Randy Chow, Richard Newman
IAT
2009
IEEE
16 years 1 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
ICEIS
2009
IEEE
16 years 1 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...