|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2394 occurrences of 1655 keywords
|
|
|
Results
Found 2458 publication records. Showing 2458 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
60 | Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin |
Inequalities for Shannon entropies and Kolmogorov complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 13-23, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
finite objects, Ingleton's inequality, Gacs-Korner's results, computational complexity, Kolmogorov complexities, Shannon entropies, linear inequalities |
45 | A. C. Cem Say, Selahattin Kuru |
Improved Filtering for the QSIM Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(9), pp. 967-971, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
spurious predictions, qualitative simulation algorithm, interval corresponding values, inconsistent states, simulation, filtering, time complexities, inference mechanisms, filtering and prediction theory, space complexities, QSIM |
45 | Ryouei Takahashi, Yukihiro Nakamura |
The effect of interface complexity on program error density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSM ![In: 1996 International Conference on Software Maintenance (ICSM '96), 4-8 November 1996, Monterey, CA, USA, Proceedings, pp. 77-86, 1996, IEEE Computer Society, 0-8186-7677-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
interface complexity, program error density, modified parts, unmodified parts, interfaced complexities, functionally related routines, discriminant analyses, reuse-ratio, optimal threshold, extended cyclomatic number, error density, software maintenance, regression analysis, subsystems, software maintainability, software errors, C-coding, software quality classification, AIC |
41 | Ibrahim Furkan Ince, Yücel Batu Salman, Mustafa Eren Yildirim |
A user study: the effects of mobile phone prototypes and task complexities on usability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 300-302, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
LG-GM730, mobile phone interface design, prototypes and task complexities, HCI, usability |
39 | Ming-Bo Lin, A. Yavuz Oruç |
Constant Time Inner Product and Matrix Computations on Permutation Network Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(12), pp. 1429-1434, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
constant time inner product, permutation network processors, algebraic computations, cost complexities, computational complexity, parallel architectures, time complexities, matrix algebra, PRAM, parallel computation model, matrix computations, CRCW PRAM |
39 | David M. Nicol, David R. O'Hallaron |
Improved Algorithms for Mapping Pipelined and Parallel Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(3), pp. 295-306, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
linear array systems, host-satellite systems, computation module execution times, intermodule communication times, homogeneity constraints, parallel mapping algorithms, parallel algorithms, computational complexity, parallel computations, time complexities, shared memory systems, space complexities, pipelined computations |
39 | Rajamani Sundar |
A Lower Bound for the Dictionary Problem under a Hashing Model ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 612-621, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
randomized complexities, update costs, deterministic complexities, constant amortized time, multilevel hashing model, log-algorithmic amortized time, nontrivial lower bound, limited wordsize, memory locations, data structures, polynomial space, dictionary problem, cell probe model |
38 | Harold W. Lawson |
The insides and outsides of computer-based system complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECBS ![In: 1997 Workshop on Engineering of Computer-Based Systems (ECBS '97), March 24-28, 1997, Monterey, CA, USA, pp. 180-, 1997, IEEE Computer Society, 0-8186-7889-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
computer-based system complexity, man-made complexities, hardware and systems software, software metrics, application softwares, computer industry |
38 | Guoyin Wang 0001, Feng Hu 0001 |
Quick Knowledge Reduction Based on Divide and Conquer Method in Huge Data Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PReMI ![In: Pattern Recognition and Machine Intelligence, Second International Conference, PReMI 2007, Kolkata, India, December 18-22, 2007, Proceedings, pp. 312-315, 2007, Springer, 978-3-540-77045-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Huge data sets processing, quick sort, attribute order, rough set, divide and conquer, attribute reduction |
35 | Clement T. Yu, Weiyi Meng |
Confronting Database Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Softw. ![In: IEEE Softw. 11(3), pp. 6-10, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
database complexities, database technology, hierarchical database model, distributed heterogeneous databases, specialized database models, database programmers, database users, database tools, data structures, database management systems, object-oriented databases, database designers, relational database model |
35 | Vince Grolmusz |
Separating the Communication Complexities of MOD m and MOD p Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 278-287, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
GIP function, MOD m circuits, MOD p circuits, depth-2, size-N circuits, k-party communication protocols, communication complexities |
34 | Vincent Chiew, Yingxu Wang 0001 |
Design of a Cognitive Complexities Measurement and Analysis Tool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCECE ![In: Proceedings of the Canadian Conference on Electrical and Computer Engineering, CCECE 2006, May 7-10, 2006, Ottawa Congress Centre, Ottawa, Canada, pp. 1667-1670, 2006, IEEE, 1-4244-0038-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Peter L. Bartlett, Shahar Mendelson |
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 224-240, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Harry B. Hunt III, Richard Edwin Stearns |
Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings, pp. 277-290, 1986, Springer, 3-540-16078-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
32 | K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau |
An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(5), pp. 639-644, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
efficient distributed protocol, negative weights, single-source shortest-path problem, asynchronous directed network, unbounded message complexity, synchronous version, Chandy-Misra algorithm, efficient synchronizer, computational complexity, protocols, distributed algorithms, distributed processing, directed graphs, time complexities, edges, cycle, nodes, worst case, asynchronous protocol |
31 | Hao Chen 0029, Liqing Xu |
On the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2005, pp. 241, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
28 | Shinobu Nagayama, Tsutomu Sasao |
Complexities of Graph-Based Representations for Elementary Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 58(1), pp. 106-119, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Ning Chen 0004, Zhiyuan Yan 0001 |
Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 57(3), pp. 1010-1020, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Yu-Cheng He, Christian Cardinal, David Haccoun |
Comparison of decoding complexities for LDPC and convolutional self-doubly-orthogonal codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PIMRC ![In: Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008, 15-18 September 2008, Cannes, French Riviera, France, pp. 1-5, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Tunga Güngör, Ali Çiltik |
Developing Methods and Heuristics with Low Time Complexities for Filtering Spam Messages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NLDB ![In: Natural Language Processing and Information Systems, 12th International Conference on Applications of Natural Language to Information Systems, NLDB 2007, Paris, France, June 27-29, 2007, Proceedings, pp. 35-47, 2007, Springer, 978-3-540-73350-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Spam e-mails, N-gram methods, Heuristics, Turkish |
28 | Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin |
Generalised Entropy and Asymptotic Complexities of Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 293-307, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Hao Chen 0095 |
Reducing the Computation of Linear Complexities of Periodic Sequences Over GF(pm). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(12), pp. 5537-5539, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Alexey V. Chernov, Jürgen Schmidhuber |
Prefix-Like Complexities and Computability in the Limit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 85-93, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
limit computability, generalized Turing machine, non-halting computation, Kolmogorov complexity |
28 | Barbara L. Marcolin, Alain Ross |
Complexities in IS sourcing: equifinality and relationship management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Base ![In: Data Base 36(4), pp. 29-46, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
IS sourcing, equifinality, framework, governance, partnership, relationship management |
28 | Michael V. Vyugin, Vladimir V. V'yugin |
Non-linear Inequalities between Predictive and Kolmogorov Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, Proceedings, pp. 190-204, 2001, Springer, 3-540-42875-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Tony Y. T. Chan |
Practical Linear Space Algorithms for Computing String-Edit Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Computational Intelligence and Bioinformatics, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part III, pp. 504-513, 2006, Springer, 3-540-37277-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
time and space complexities, algorithms, String-edit distance |
26 | Dawn N. Jutla, Peter Bodorik, Y. Cai |
Interoperability for Accessing DBs by E-Commerce Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 34th Annual Hawaii International Conference on System Sciences (HICSS-34), January 3-6, 2001, Maui, Hawaii, USA, 2001, IEEE Computer Society, 0-7695-0981-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
DB access, SQL queries, Reducing complexities, Interoperability, Framework, CORBA, Application program interface, Distributed Objects, DCOM |
26 | Tamal K. Dey |
Improved Bounds on Planar k-sets and k-levels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 156-161, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
planar k-sets, k-levels, parametric minimum spanning trees, parametric matroids, computational complexity, line segments, combinatorial complexities, convex polygons |
26 | Tatsuo Nakajima |
A toolkit for building continuous media applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 4th International Workshop on Real-Time Computing Systems and Applications (RTCSA '97), 27-29 October 1997, Taipei, Taiwan, pp. 268-275, 1997, IEEE Computer Society, 0-8186-8073-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
continuous media applications, multimedia programming, dynamic QOS control, real-time Mach microkernel, complexities, multimedia computing, multimedia computing, scripting language, real-time processing, media synchronization |
26 | John Yiannis Cotronis |
Efficient Program Composition on Parix by the Ensemble Methodology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 22rd EUROMICRO Conference '96, Beyond 2000: Hardware and Software Design Strategies, September 2-5, 1996, Prague, Czech Republic, pp. 545-552, 1996, IEEE Computer Society, 0-8186-7487-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
program composition, Parix, Ensemble methodology, message passing program composition methodology, Process Communication Graphs, application scripts, universal Parix program loader, communication dependencies, complexities, message passing, parallel virtual machine |
26 | Omer Berkman, Yossi Matias |
Fast parallel algorithms for minimum and related problems with small integer inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 203-207, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
integer inputs, prefix minima, range minima, integer domain, domain size, parallel algorithms, parallel algorithms, computational complexity, complexities, running time |
26 | Mark Genoe, Paul Vanoostende, Geert van Wauwe |
On the use of VHDL-based behavioral synthesis for telecom ASIC design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSS ![In: Proceedings of the 8th International Symposium on System Synthesis (ISSS 1995), September 13-15, 1995, Cannes, France, pp. 96-103, 1995, ACM, 0-89791-771-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Alcatel-Bell, RTL-synthesizable description, behavioral synthesis tools, hardware CAD tool, system level design methodology, telecom ASIC design, telecom system hardware design, high level synthesis, VHDL, VHDL, application specific integrated circuits, ASIC, logic synthesis, integrated circuit design, hardware description languages, integrated logic circuits, behavioral synthesis, telecommunication computing, hardware software codesign, design complexities |
26 | Vinod Narayananan, David LaPotin, Rajesh Gupta 0003, Gopalakrishnan Vijayan |
PEPPER - a timing driven early floorplanner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 230-235, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
PEPPER, timing driven early floorplanner, chip complexities, early analysis, performance critical CMOS chips, wireability, floorplan optimization process, performance, computational complexity, optimisation, timing, system design, circuit layout CAD, CMOS integrated circuits, static timing analysis, integrated circuit layout, area, interconnect delay |
26 | Yingsha Liao, Donald Cohen |
A Specificational Approach to High Level Program Monitoring and Measuring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 18(11), pp. 969-979, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
program measurement, specificational approach, high level program monitoring, execution characteristics, instrumentation code, high-level specification language, augmented program, complexities, formal specification, software metrics, specification languages, automatic programming, system monitoring, special-purpose hardware |
26 | Tadao Murata, Boris Shenker, Sol M. Shatz |
Detection of Ada Static Deadlocks Using Petri Net Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(3), pp. 314-326, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
Ada static deadlocks, Petri net invariants, Ada tasking programs, message-flow, computational complexity, complexities, Petri nets, Ada, concurrency control, program testing, system recovery, control-flow |
26 | Viktor K. Prasanna, Venkatesh Krishnan |
Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(6), pp. 665-669, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
image template matching, hypercube SIMD machines, parallel algorithms, parallel algorithms, computational complexity, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, time complexities, bounds |
25 | Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri |
Low depth cache-oblivious algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 189-199, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
sparse-matrix vector multiply, schedulers, parallel algorithms, multiprocessors, sorting, graph algorithms, cache-oblivious algorithms |
25 | Veli Mäkinen, Gonzalo Navarro 0001 |
Dynamic entropy-compressed sequences and full-text indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 32:1-32:38, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Compressed dynamic data structures, compressed text databases, partial sums, entropy, sequences |
22 | Pierre Fraigniaud |
Distributed computational complexities: are you volvo-addicted or nascar-obsessed? ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 171-172, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
mobile computing, network computing, wait-free computing |
22 | Miklos Santha, Mario Szegedy |
Quantum and Classical Query Complexities of Local Search Are Polynomially Related. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(3), pp. 557-575, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Local search, Quantum computing, Query complexity |
22 | Jackey Z. Yan, Natarajan Viswanathan, Chris Chu |
Handling complexities in modern large-scale mixed-size placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 436-441, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
incremental placement, mixed-size design, floorplanning |
22 | Joseph Kibombo Balikuddembe, Anet Potgieter |
Using Actor Object Operations Structures to Understand Project Requirements Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSEA ![In: Proceedings of the Third International Conference on Software Engineering Advances, ICSEA 2008, October 26-31, 2008, Sliema, Malta, pp. 290-294, 2008, IEEE Computer Society, 978-0-7695-3372-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Georg Moser, Andreas Schnabl |
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 276-290, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Gary R. Mayer, Hessam S. Sarjoughian |
Complexities of simulating a hybrid agent-landscape model using multi-formalism composability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim (2) ![In: Proceedings of the 2007 Spring Simulation Multiconference, SpringSim 2007, Norfolk, Virginia, USA, March 25-29, 2007, Volume 2, pp. 161-168, 2007, SCS/ACM, 1-56555-313-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
poly-formalism, agents, cellular automata, multi-modeling, multi-formalism |
22 | Jia-Huai You, Li-Yan Yuan, Guohua Liu, Yi-Dong Shen |
Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings, pp. 228-240, 2007, Springer, 978-3-540-72199-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Kazuho Watanabe, Motoki Shiga, Sumio Watanabe |
Upper Bounds for Variational Stochastic Complexities of Bayesian Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAL ![In: Intelligent Data Engineering and Automated Learning - IDEAL 2006, 7th International Conference, Burgos, Spain, September 20-23, 2006, Proceedings, pp. 139-146, 2006, Springer, 3-540-45485-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Yingxu Wang |
Psychological experiments on the cognitive complexities of fundamental control structures of software systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ICCI ![In: Proceedings of the 4th IEEE International Conference on Cognitive Informatics (ICCI 2005), August 8-10, 2005, University of California, Irvine, USA, pp. 4-5, 2005, IEEE Computer Society, 0-7803-9136-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Kevin M. Taaffe, Rachel Kohl, Delbert L. Kimbler |
Hospital evacuation: issues and complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 4-7, 2005, pp. 943-950, 2005, IEEE Computer Society, 0-7803-9519-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Yun-Pyo Hong, Hong-Yeop Song |
Frequency/Time Hopping Sequences with Large Linear Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCC ![In: Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers, pp. 386-396, 2005, Springer, 978-3-540-35481-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Boris Aronov, Micha Sharir |
Cell Complexities in Hyperplane Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(1), pp. 107-115, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Miklos Santha, Mario Szegedy |
Quantum and classical query complexities of local search are polynomially related. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 494-501, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
PLO, neighborhood structure, decision trees, quantum computation, query model, local optimization |
22 | Peter Høyer, Jan Neerbek, Yaoyun Shi |
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 34(4), pp. 429-448, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Henry N. Adorna |
On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers, pp. 152-161, 2002, Springer, 3-540-40431-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Peter Høyer, Jan Neerbek, Yaoyun Shi |
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 346-357, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Prasad V. Saraph |
Simulating biotech manufacturing operations: issues and complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 33nd conference on Winter simulation, WSC 2001, Arlington, VA, USA, December 9-12, 2001, pp. 530-524, 2001, WSC, 0-7803-7309-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Sylvia B. Encheva, Gérard D. Cohen |
On the State Complexities of Ternary Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings, pp. 454-461, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
22 | Cunsheng Ding |
Lower Bounds on the Weight Complexities of Cascaded Binary Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AUSCRYPT ![In: Advances in Cryptology - AUSCRYPT '90, International Conference on Cryptology, Sydney, Australia, January 8-11, 1990, Proceedings, pp. 39-43, 1990, Springer, 3-540-53000-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Helmut Alt |
Comparing the combinational complexities of arithmetic functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(2), pp. 447-460, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
22 | Thomas Lengauer, Klaus W. Wagner |
The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 100-113, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Mourad Elloumi, Ahmed Mokaddem |
An Algorithm for Multiple and Global Alignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIRD ![In: Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings, pp. 479-488, 2008, Springer, 978-3-540-70598-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multiple and global alignments, common subsequence, algorithms, complexities, Strings, divide-and-conquer strategy |
20 | Hatem Tahri, Mourad Elloumi |
A New Approximation Algorithm for the Minimum Fragment Removal Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIRD ![In: Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings, pp. 427-435, 2008, Springer, 978-3-540-70598-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
haplotype assembly, minimum fragment removal, vertex bipartization, algorithms, complexities, Graphs |
20 | Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Chuan Yi Tang |
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2007 International Conference on Parallel Processing (ICPP 2007), September 10-14, 2007, Xi-An, China, pp. 14, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hirschberg’s technique, time and space complexities, dynamic programming, computational biology, sequence alignment |
20 | Lior Shabtay, Adrian Segall |
Low Complexity Network Synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings, pp. 223-237, 1994, Springer, 3-540-58449-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
sparse covers, communication and time complexities, networks, distributed algorithms, synchronization |
20 | Dinesh P. Mehta, Sartaj Sahni |
A Data Structure for Circular String Analysis and Visualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(8), pp. 992-997, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
circular string analysis, compact symmetric directed acyclic word graph, linear strings, visualization, computational complexity, data structure, data structures, computational geometry, directed graphs, time complexity, object-oriented language, data visualisation, space complexities |
20 | Keh-Chang Guh, Clement T. Yu |
Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 4(4), pp. 371-381, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
centralised environments, materialized generalized transitive closure, computational complexity, parallel processing, data structure, data structures, expert systems, queries, time complexities, deductive databases, insertions, deletions, parallel environments, multiprocessor environment |
20 | Leonard J. Schulman |
Communication on Noisy Channels: A Coding Theorem for Computation ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 724-733, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
private-coin noisy channel protocol, coding theorem, noiseless channel protocol, complexities, parallel computing, distributed computing, computation, errors, noisy channels, noisy channel |
20 | A. Yavuz Oruç, Millind Mittal |
Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(2), pp. 217-221, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
setup algorithms, cube-connected parallel computers, recursive Karnaugh maps, one-pass permutations, parallel algorithms, computational complexity, time complexities, transportations, cycles, cycles, paths, transpositions |
20 | Kar-Lik Wong, Wan-Chi Siu |
Data Routing Networks for Systolic/Pipeline Realization of Prime Factor Mapping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(9), pp. 1072-1074, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
prime factor mapping, data routing networks, low circuit complexities, very-high-throughput, parallel architectures, pipeline architecture, systolic architecture |
20 | László Lovász 0001, Moni Naor, Ilan Newman, Avi Wigderson |
Search Problems in the Decision Tree Model (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 576-585, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Boolean decision tree model, CNF search, complexities, randomness, search problems, determinism, nondeterminism |
20 | Wolfgang Maass 0001, György Turán |
On the Complexity of Learning from Counterexamples and Membership Queries ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 203-210, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
nondecreasing functions, domain subsets, learning from counterexamples, learning complexities, online learning models, combinatorial parameters, monomials, lower bound, membership queries, equivalence queries, threshold gates, concept class |
20 | Marina Roesler, Walter A. Burkhard |
Resolution of Deadlocks in Object-Oriented Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(8), pp. 1212-1224, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
worst time complexity, object-oriented distributed systems, semantic lock model, message traffic, average time complexities, distributed algorithm, distributed databases, concurrency control, deadlocks resolution, dependence relations, concurrency control algorithms |
20 | K. V. S. Ramarao |
Distributed Algorithms for Network Recognition Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(9), pp. 1240-1248, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
unified algorithms, network recognition, noncentralized initiations, computational complexity, distributed algorithms, distributed processing, computer networks, tree, time complexities, communication complexity, bipartite graph, ring, centralized, decentralized, star, complete graph |
20 | Maciej Liskiewicz, Krzysztof Lorys |
On Reversal Complexity for Alternating Turing Machines (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 618-623, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
reversal complexity, nonregular languages, ATM, space complexities, alternating Turing machines |
19 | Yanhong A. Liu, Scott D. Stoller |
From datalog rules to efficient programs with time and space guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 31(6), pp. 21:1-21:38, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
data structure design, indexed representations, linked representations, optimization, indexing, program transformation, Datalog, recursion, tabling, Complexity analysis, incremental computation |
19 | Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone |
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(2), pp. 371-401, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Chi-Sing Leung, Kwok-Wo Wong, Yong Xu |
The Local True Weight Decay Recursive Least Square Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (1) ![In: Neural Information Processing, 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I, pp. 456-465, 2007, Springer, 978-3-540-69154-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Gang Cheng 0003, Nirwan Ansari, Li Zhu |
Enhancing epsilon-Approximation Algorithms With the Optimal Linear Scaling Factor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 54(9), pp. 1624-1632, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Doron Bustan, John Havlicek |
Some Complexity Results for SystemVerilog Assertions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 205-218, 2006, Springer, 3-540-37406-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Eli Biham, Orr Dunkelman, Nathan Keller |
Related-Key Impossible Differential Attacks on 8-Round AES-192. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2006, The Cryptographers' Track at the RSA Conference 2006, San Jose, CA, USA, February 13-17, 2006, Proceedings, pp. 21-33, 2006, Springer, 3-540-31033-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
related-key differentials, AES, impossible differentials |
19 | Arash Reyhani-Masoleh, M. Anwar Hasan |
Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2^{m}). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(8), pp. 945-959, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Berk Sunar |
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(9), pp. 1097-1105, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Ingo Lepper |
Simply terminating rewrite systems with long derivations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(1), pp. 1-18, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Simple termination, Hardy hierarchy, Fundamental sequence, Hydra |
19 | Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger |
Exact (Exponential) Algorithms for the Dominating Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 245-256, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Jared Hayes, Antoni B. Moore, George L. Benwell, B. L. William Wong |
Ambulance Dispatch Complexity and Dispatcher Decision Strategies: Implications for Interface Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCHI ![In: Computer Human Interaction, 6th Asia Pacific Conference, APCHI 2004, Rotorua, New Zealand, June 29 - July 2, 2004, Proceedings, pp. 589-593, 2004, Springer, 3-540-22312-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Alex Biryukov, Christophe De Cannière, Michaël Quisquater |
On Multiple Linear Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings, pp. 1-22, 2004, Springer, 3-540-22668-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multiple linear approximations, stochastic systems of linear equations, maximum likelihood decoding, key-ranking, AES, DES, Linear cryptanalysis |
19 | Yanhong A. Liu, Scott D. Stoller |
From datalog rules to efficient programs with time and space guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 27-29 August 2003, Uppsala, Sweden, pp. 172-183, 2003, ACM, 1-58113-705-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
data structure design, indexed representations, linked representations, optimization, indexing, program transformation, datalog, recursion, tabling, complexity analysis, incremental computation |
19 | Sorin Cotofana, Stamatis Vassiliadis |
Signed Digit Addition and Related Operations with Threshold Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(3), pp. 193-207, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
signed-digit arithmetic, redundant adders, redundant multipliers, neural networks, Computer arithmetic, threshold logic, carry-free addition, signed-digit number representation |
19 | Ngoc Binh Nguyen, Tu Bao Ho |
A Mixed Similarity Measure in Near-Linear Computational Complexity for Distance-Based Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Principles of Data Mining and Knowledge Discovery, 4th European Conference, PKDD 2000, Lyon, France, September 13-16, 2000, Proceedings, pp. 211-220, 2000, Springer, 3-540-41066-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
mixed similarity measure (MSM), distance-based methods, computational complexity, very large databases |
19 | David Z. Gevorkian, Jaakko Astola, Samvel M. Atourian |
Improving Gil-Werman Algorithm for Running Min and Max Filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 19(5), pp. 526-529, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Running min and max, algorithms, computational complexity, morphological filters |
19 | Piyush Maheshwari |
Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 300-311, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
time and communication complexity functions, scheduling, partitioning, Functional programming, granularity |
16 | Xueping Yan, Lin Tan 0003, Hong Xu 0008, Wen-Feng Qi 0001 |
Improved mixture differential attacks on 6-round AES-like ciphers towards time and data complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Secur. Appl. ![In: J. Inf. Secur. Appl. 80, pp. 103661, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Huimin Han, Zehua Liu, Jiuhao Li, Zhixiong Zeng |
Challenges in remote sensing based climate and crop monitoring: navigating the complexities using AI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cloud Comput. ![In: J. Cloud Comput. 13(1), pp. 34, December 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Modjtaba Ghorbani, Zahra Vaziri |
On the Szeged and Wiener complexities in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 470, pp. 128532, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Lijiao Jia, Yunil Roh, Guangri Piao, Il Hyo Jung |
Dynamic Complexities in Competing Parasitoid Species on a Shared Host. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Bifurc. Chaos ![In: Int. J. Bifurc. Chaos 34(2), pp. 2450014:1-2450014:25, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Bin Gu 0001, Xiyuan Wei, Hualin Zhang, Yi Chang, Heng Huang |
Obtaining Lower Query Complexities Through Lightweight Zeroth-Order Proximal Gradient Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. ![In: Neural Comput. 36(5), pp. 897-935, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Florian Kern, Jonathan Tschanter, Marc Erich Latoschik |
Handwriting for Text Input and the Impact of XR Displays, Surface Alignments, and Sentence Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 30(5), pp. 2357-2367, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Pranav Khadpe, Lindy Le, Kate Nowak, Shamsi T. Iqbal, Jina Suh |
DISCERN: Designing Decision Support Interfaces to Investigate the Complexities of Workplace Social Decision-Making With Line Managers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.19318, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Dongqi Pu, Yifan Wang, Jia E. Loy, Vera Demberg |
SciNews: From Scholarly Complexities to Public Narratives - A Dataset for Scientific News Report Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.17768, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Lijun Chang |
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.07561, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Kento Imaizumi, Hideaki Iiduka |
Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.15344, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2458 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|