Sciweavers

257 search results - page 8 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
DCC
2008
IEEE
16 years 1 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
134
Voted
ATAL
2008
Springer
15 years 3 months ago
Demonstration of multi-agent potential fields in real-time strategy games
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
Johan Hagelbäck, Stefan J. Johansson
100
Voted
IJCAI
2007
15 years 3 months ago
Locating Complex Named Entities in Web Text
Named Entity Recognition (NER) is the task of locating and classifying names in text. In previous work, NER was limited to a small number of predefined entity classes (e.g., peop...
Doug Downey, Matthew Broadhead, Oren Etzioni
TMC
2008
127views more  TMC 2008»
15 years 1 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
PARELEC
2006
IEEE
15 years 7 months ago
Marching Pixels - Using Organic Computing Principles in Embedded Parallel Hardware
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
Marcus Komann, Dietmar Fey