15033 search results - page 390 / 3007 » Complexity Theory and Algorithms |
230
click to vote
COMPGEOM
2004
ACM
16 years 28 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
207
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
180
Voted
ISCAS
2003
IEEE
16 years 23 days ago
2003
IEEE
In Exponentially-ModulatedFilter Bank (EMFB) the complex subfilters are generated from a real-valued prototype filter by multiplying the filter impulse response with complex expon...
171
Voted
STACS
2000
Springer
15 years 11 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
184
Voted
AAAI
2008
15 years 9 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...