Search results for "Find"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
46	Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das 0001	A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking.	IPPS	1996	DBLP DOI BibTeX RDF	parallel solution, extended set union problem, unlimited backtracking, Find, SetUnion, MultiUnion, k-Parallel Union Find trees, constant parallel time, optimal work, constant-time performance, parallel algorithms, computational complexity, data structure, parallel machines, Restore, backtracking, Backtrack, tree data structures, tree searching, random-access storage, dynamic partition, Union, EREW-PRAM model
43	Pankaj K. Agarwal, Lars Arge, Ke Yi 0001	I/O-efficient batched union-find and its applications to terrain analysis.	SCG	2006	DBLP DOI BibTeX RDF	terrain analysis, algorithms, union-find, I/O-efficient, contour trees
41	Robert C. Miller, Alisa M. Marshall	Cluster-based find and replace.	CHI	2004	DBLP DOI BibTeX RDF	find & replace, clustering, text editing, error prevention
40	Mark D. Smucker, James Allan	Find-similar: similarity browsing as a search tool.	SIGIR	2006	DBLP DOI BibTeX RDF	find-similar, similarity browsing, relevance feedback
38	Sylvain Conchon, Jean-Christophe Filliâtre	A persistent union-find data structure.	ML	2007	DBLP DOI BibTeX RDF	formal verification, persistence, union-find
35	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Union-find with deletions.	SODA	2002	DBLP BibTeX RDF
35	Marek J. Lao	A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity.	CAAP	1981	DBLP DOI BibTeX RDF	computational complexity, data structures, trees, UNION-FIND, set union
34	Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov	Improving 3N Circuit Complexity Lower Bounds.	Comput. Complex.	2023	DBLP DOI BibTeX RDF
34	Giorgio Trumpy, Casper Find Andersen, Ivar Farup, Omar Elezabi	Mapping Quantitative Observer Metamerism of Displays.	J. Imaging	2023	DBLP DOI BibTeX RDF
34	Casper Find Andersen, Ivar Farup, Jon Yngve Hardeberg	Additivity Constrained Linearisation of Camera Calibration Data.	IEEE Trans. Image Process.	2023	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find, René Peralta 0001	Small low-depth circuits for cryptographic applications.	Cryptogr. Commun.	2019	DBLP DOI BibTeX RDF
34	Magnus Gausdal Find, René Peralta 0001	Better Circuits for Binary Polynomial Multiplication.	IEEE Trans. Computers	2019	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	Multiplicative complexity of vector valued Boolean functions.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
34	Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan	The number of boolean functions with multiplicative complexity 2.	Int. J. Inf. Coding Theory	2017	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find, René Peralta 0001	On various nonlinearity measures for boolean functions.	Cryptogr. Commun.	2016	DBLP DOI BibTeX RDF
34	Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen	Separating OR, SUM, and XOR circuits.	J. Comput. Syst. Sci.	2016	DBLP DOI BibTeX RDF
34	Casper Find Andersen, David Connah	Weighted Constrained Hue-Plane Preserving Camera Characterization.	IEEE Trans. Image Process.	2016	DBLP DOI BibTeX RDF
34	Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov	A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.	FOCS	2016	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	Cancellation-free circuits in unbounded and bounded depth.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
34	Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov	A better-than-3n lower bound for the circuit complexity of an explicit function.	Electron. Colloquium Comput. Complex.	2015	DBLP BibTeX RDF
34	Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan	The Number of Boolean Functions with Multiplicative Complexity 2.	IACR Cryptol. ePrint Arch.	2015	DBLP BibTeX RDF
34	Michal Mackiewicz, Casper Find Andersen, Graham D. Finlayson	Hue Plane Preserving Colour Correction using Constrained Least Squares Regression.	CIC	2015	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	Constructive Relationships Between Algebraic Thickness and Normality.	FCT	2015	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	Constructive Relationships Between Algebraic Thickness and Normality.	CoRR	2014	DBLP BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	The Relationship Between Multiplicative Complexity and Nonlinearity.	CoRR	2014	DBLP BibTeX RDF
34	Magnus Gausdal Find	On the Complexity of Computing Two Nonlinearity Measures.	CoRR	2014	DBLP BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	The Relationship between Multiplicative Complexity and Nonlinearity.	MFCS (2)	2014	DBLP DOI BibTeX RDF
34	Magnus Gausdal Find	On the Complexity of Computing Two Nonlinearity Measures.	CSR	2014	DBLP DOI BibTeX RDF
34	Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen	Separating OR, SUM, and XOR Circuits	CoRR	2013	DBLP BibTeX RDF
34	Joan Boyar, Magnus Find	Cancellation-Free Circuits in Unbounded and Bounded Depth	CoRR	2013	DBLP BibTeX RDF
34	Joan Boyar, Magnus Find, René Peralta 0001	Four Measures of Nonlinearity.	IACR Cryptol. ePrint Arch.	2013	DBLP BibTeX RDF
34	Joan Boyar, Magnus Gausdal Find	Cancellation-Free Circuits in Unbounded and Bounded Depth.	FCT	2013	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Find, René Peralta 0001	Four Measures of Nonlinearity.	CIAC	2013	DBLP DOI BibTeX RDF
34	Joan Boyar, Magnus Find	Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators	CoRR	2012	DBLP BibTeX RDF
34	Milan Koren, Slavomír Find'o, Michaela Skuban, Matús Kajba	Habitat suitability modelling from non-point data: The case study of brown bear habitat in Slovakia.	Ecol. Informatics	2011	DBLP DOI BibTeX RDF
34	Casper Find Andersen, Graham D. Finlayson	Estimation of an individual's Human Cone Fundamentals from their Color Matching Functions.	CGIV/MCS	2010	DBLP BibTeX RDF
34	Casper Find Andersen	New results in colour characterization of humans and cameras.		2010	RDF
34	Ali Alsam, Casper Find Andersen	Robust Averaged Projections Onto Convex Sets.	CGIV/MCS	2008	DBLP BibTeX RDF
34	Christian Wichmann Matthiessen, Annette Winkel Schwarz, Søren Find	World cities of knowledge: research strength, networks and nodality.	J. Knowl. Manag.	2006	DBLP DOI BibTeX RDF
34	Casper Find Andersen, Jon Yngve Hardeberg	Colorimetric Characterization of Digital Cameras Preserving Hue Planes.	CIC	2005	DBLP DOI BibTeX RDF
34	Rao Desineni, Leah Pastel, Maroun Kassab, Robert Redburn	Hard to find, easy to find systematics; just find them.	ITC	2010	DBLP DOI BibTeX RDF
33	Jimmy Lin, Mark D. Smucker	How do users find things with PubMed?: towards automatic utility evaluation with user simulations.	SIGIR	2008	DBLP DOI BibTeX RDF	find-similar, related article search
28	Kesheng Wu, Ekow J. Otoo, Kenji Suzuki 0001	Optimizing two-pass connected-component labeling algorithms.	Pattern Anal. Appl.	2009	DBLP DOI BibTeX RDF	Union-find algorithm, Optimization, Decision tree, Equivalence relation, Connected-component labeling
27	Michael D. Adams 0001, R. Kent Dybvig	Efficient nondestructive equality checking for trees and graphs.	ICFP	2008	DBLP DOI BibTeX RDF	dfa equivalence, eq hash tables, scheme, equality, union-find
27	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding priority queues.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find
27	Arnold Meijster, Michael H. F. Wilkinson	A Comparison of Algorithms for Connected Set Openings and Closings.	IEEE Trans. Pattern Anal. Mach. Intell.	2002	DBLP DOI BibTeX RDF	connected set operators, attribute filters, pattern spectra, mathematical morphology, multiscale analysis, union-find
25	Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick	Union-Find with Constant Time Deletions.	ICALP	2005	DBLP DOI BibTeX RDF
25	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Meldable heaps and boolean union-find.	STOC	2002	DBLP DOI BibTeX RDF
24	Yoshiko Habuchi, Muneo Kitajima, Haruhiko Takeuchi	Comparison of eye movements in searching for easy-to-find and hard-to-find information in a hierarchically organized information structure.	ETRA	2008	DBLP DOI BibTeX RDF	hierarchical information structure, latent semantic analysis, web usability, information scent, LSA
23	Amir M. Ben-Amram, Zvi Galil	Lower Bounds for Dynamic Data Structures on Algebraic RAMs.	Algorithmica	2002	DBLP DOI BibTeX RDF	Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
23	Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi	Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.	Algorithmica	2001	DBLP DOI BibTeX RDF	Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
23	Adelka Niels, Jutta Fortmann	Find your way in the UX process jungle: An introduction to UX process models and methods and a practical session on how to find a suitable process for your project.	CHI Extended Abstracts	2023	DBLP DOI BibTeX RDF
23	Cennet Oguz, Pascal Denis, Emmanuel Vincent 0001, Simon Ostermann 0002, Josef van Genabith	Find-2-Find: Multitask Learning for Anaphora Resolution and Object Localization.	EMNLP	2023	DBLP DOI BibTeX RDF
23	Michael Krivelevich	Expanders - how to find them, and what to find in them.	BCC	2019	DBLP DOI BibTeX RDF
23	Mohammed R. H. Qwaider, Anne-Lyse Minard, Manuela Speranza, Bernardo Magnini	Find Problems before They Find You with AnnotatorPro's Monitoring Functionalities.	CLiC-it	2017	DBLP BibTeX RDF
23	David Carlson	Why Can't I Find My Data the Way I Find My Dinner?	ICDE	2009	DBLP DOI BibTeX RDF
23	Gary Marchionini, Ryen White	Find What You Need, Understand What You Find.	Int. J. Hum. Comput. Interact.	2007	DBLP DOI BibTeX RDF
23	Jan Heß, Volker Wulf	Community-orientierte Dienste für digitales interaktives Fernsehen: Das Beispiel der "Find-a-Friend"-Anwendung (Community Based Services for Digital Interactive Television: The "Find-a-Friend" Prototype).	i-com	2006	DBLP DOI BibTeX RDF
23	Johannes A. La Poutré	Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines.	J. Comput. Syst. Sci.	1996	DBLP DOI BibTeX RDF
23	Johannes A. La Poutré	Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines	STOC	1990	DBLP DOI BibTeX RDF
22	Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi	On Smoothed Analysis of Quicksort and Hoare's Find.	COCOON	2009	DBLP DOI BibTeX RDF
22	Costantino Grana, Daniele Borghesani, Rita Cucchiara	Connected Component Labeling Techniques on Modern Architectures.	ICIAP	2009	DBLP DOI BibTeX RDF	comparison, union-find, connected component labeling
22	Xiwei Feng, Feng Xue, Tongwei Zhang	Research on Data Exchange Push Technology Based on Message-driven.	JCAI	2009	DBLP DOI BibTeX RDF	recommended find, message-driven, Server Push, publish/ Subscribe, Data Exchange
22	Constantine Dovrolis	What would Darwin think about clean-slate architectures?	Comput. Commun. Rev.	2008	DBLP DOI BibTeX RDF	FP7-ICT FIRE, NSF FIND, internet, GENI
22	Andrzej S. Murawski, C.-H. Luke Ong	Fast verification of MLL proof nets via IMLL.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets
22	Peter Dawyndt, Marc Vancanneyt, Hans E. De Meyer, Jean Swings	Knowledge Accumulation and Resolution of Data Inconsistencies during the Integration of Microbial Information Sources.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	synonymy, error detection/correction, microbiology, Transitive closure, homology, union-find
22	Chenyu Wu, Ce Liu 0001, Heung-Yeung Shum, Ying-Qing Xu, Zhengyou Zhang	Automatic Eyeglasses Removal from Face Images.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	Intelligent image editing, find-and-replace, eye region detection, eyeglasses localization, eyeglasses removal
22	Bin Xu 0009, Danny Z. Chen, Robert J. Szczerba	Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees.	Agents	2000	DBLP DOI BibTeX RDF	cell decomposition, framed-octrees, union-find structure, computational geometry, path planning, optimal paths
22	Marc J. van Kreveld, Mark H. Overmars	Union-Copy Structures and Dynamic Segment Trees.	J. ACM	1993	DBLP DOI BibTeX RDF	union-find structure
22	Amir M. Ben-Amram, Zvi Galil	Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time
22	Neil V. Murray	Some Observations on Equivalence Handling Methods.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	path compression, tree balancing, partition, Equivalence, UNION-FIND
20	Shuo Guo, Ziguo Zhong, Tian He 0001	FIND: faulty node detection for wireless sensor networks.	SenSys	2009	DBLP DOI BibTeX RDF	data fault detection, wireless sensor networks
19	Robert Law	Using student blogs for documentation in software development projects.	ITiCSE	2011	DBLP DOI BibTeX RDF
18	Jacques Patarin	How to Find and Avoid Collisions for the Knapsack Hash Function.	EUROCRYPT	1993	DBLP DOI BibTeX RDF
17	Esteban García-Cuesta, Inés María Galván, Antonio J. de Castro	Discriminant Regression Analysis to Find Homogeneous Structures.	IDEAL	2009	DBLP DOI BibTeX RDF	density clustering, dimensionality reduction, LDA, spectral clustering, discriminant models
17	Sven Laumer, Andreas Eckhardt	Help to find the needle in a haystack: integrating recommender systems in an IT supported staff recruitment system.	CPR	2009	DBLP DOI BibTeX RDF	it architecture, recommender systems, design science, e-recruiting
17	Kazuhiro Suzuki, Kaoru Kurosawa	How to Find Many Collisions of 3-Pass HAVAL.	IWSEC	2007	DBLP DOI BibTeX RDF	hash function, collision, differential attack, HAVAL
17	David Hovemeyer, Jaime Spacco, William W. Pugh	Evaluating and tuning a static analysis to find null pointer bugs.	PASTE	2005	DBLP DOI BibTeX RDF	testing, static analysis
17	Kurt Mehlhorn, Stefan Näher, Helmut Alt	A Lower Bound for the Complexity of the Union-Split-Find Problem.	ICALP	1987	DBLP DOI BibTeX RDF
15	Liang Tang, Changjie Tang, Lei Duan, Yexi Jiang, Jie Zuo, Jun Zhu	SLICE: A Novel Method to Find Local Linear Correlations by Constructing Hyperplanes.	APWeb/WAIM	2009	DBLP DOI BibTeX RDF	Linear Correlation, Data Mining, Principal Component Analysis
15	Guoqing Xu 0001, Matthew Arnold, Nick Mitchell, Atanas Rountev, Gary Sevitsky	Go with the flow: profiling copies to find runtime bloat.	PLDI	2009	DBLP DOI BibTeX RDF	copy graph, memory bloat, profiling, heap analysis
15	Carlos Lara-Alvarez, Leonardo Romero, Juan J. Flores, Cuauhtemoc Gomez	A Simple Sample Consensus Algorithm to Find Multiple Models.	CIARP	2009	DBLP DOI BibTeX RDF
15	Myoung Kim, Yoonsik Cheon	A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs.	ICST	2008	DBLP DOI BibTeX RDF	genetic algorithms, object-oriented programming, test data generator, fitness function, evolutionary testing, pre and postconditions, JML language
15	Yihui Liu, Li Bai	Find Key m/z Values in Predication of Mass Spectrometry Cancer Data.	ICIC (1)	2008	DBLP DOI BibTeX RDF
15	Pingda Shu, Huahui Chen 0001	A New Method to Find Top K Items in Data Streams at Arbitrary Time Granularities.	CSSE (4)	2008	DBLP DOI BibTeX RDF
15	Chun-Hung Lu, Chih-Chien Wang, Min-Yuh Day, Chorng-Shyong Ong, Wen-Lian Hsu	Using "Cited by" Information to Find the Context of Research Papers.	ISI Workshops	2008	DBLP DOI BibTeX RDF	Automatic meta-analysis, Human factors, Link mining
15	Yasusi Sinohara, Atsuhiro Takasu	Support Kernel Machine-Based Active Learning to Find Labels and a Proper Kernel Simultaneously.	IDEAL	2007	DBLP DOI BibTeX RDF
15	Thom W. Frühwirth	Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR.	CSCLP	2007	DBLP DOI BibTeX RDF
15	Kristof Beyls, Erik H. D'Hollander	Intermediately executed code is the key to find refactorings that improve temporal data locality.	Conf. Computing Frontiers	2006	DBLP DOI BibTeX RDF	performance debugger, temporal data locality, program analysis, refactoring, program optimizations, loop transformations
15	Byung Ryong Kim, Ki-Chang Kim	A Proposal of Extension of FMS-Based Mechanism to Find Attack Paths.	ICCSA (3)	2006	DBLP DOI BibTeX RDF
15	Qingzhang Chen, Jianghong Han, Wenxiu He, Yungang Lai	Utilize Fuzzy Data Mining to Find the Travel Pattern of Browsers.	CIT	2005	DBLP DOI BibTeX RDF	Maximum Forward Reference, Data Mining, Fuzzy set theory
15	Sandip Debnath, C. Lee Giles	A learning based model for headline extraction of news articles to find explanatory sentences for events.	K-CAP	2005	DBLP DOI BibTeX RDF	explanatory sentence, news metadata, metadata extraction
15	Yusuke Hayashi, Mitsuru Ikeda	Intellectual Reputation to Find an Appropriate Person for a Role in Creation and Inheritance of Organizational Intellect.	Intelligent Tutoring Systems	2004	DBLP DOI BibTeX RDF
15	René Arnulfo García-Hernández, José Francisco Martínez Trinidad, Jesús Ariel Carrasco-Ochoa	A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text.	CIARP	2004	DBLP DOI BibTeX RDF
15	Kwang-Su Yang, Ruixin Yang, Jiang Tang, Menas Kafatos	An Efficient Method to Find Area Clusters with Constraints Using Grid Index Structure.	SSDBM	2004	DBLP DOI BibTeX RDF
15	John Russell	Find what I mean: exploring new kinds of search results.	SIGDOC	2002	DBLP DOI BibTeX RDF	search, navigation, hierarchy, web interfaces, books, online information
15	Ye-In Chang, Yu-Ming Hsieh	SETM*-MaxK: An Efficient SET-Based Approach to Find the Largest Itemset.	PAKDD	2002	DBLP DOI BibTeX RDF
15	Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa	A Practical Algorithm to Find the Best Subsequence Patterns.	Discovery Science	2000	DBLP DOI BibTeX RDF
15	Sayaka Nagai, Shin-Ichi Nakano	A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs.	WG	2000	DBLP DOI BibTeX RDF
15	Koh Hosoda, Minoru Asada	How Does a Robot Find Redundancy by Itself?	EWLR	1999	DBLP DOI BibTeX RDF